Skolem sequences and additive permutations
نویسندگان
چکیده
منابع مشابه
On the number of additive permutations and Skolem-type sequences
Cavenagh and Wanless recently proved that, for sufficiently large odd n, the number of transversals in the Latin square formed from the addition table for integers modulo n is greater than (3.246). We adapt their proof to show that for sufficiently large t the number of additive permutations on [−t, t] is greater than (3.246) and we go on to derive some much improved lower bounds on the numbers...
متن کاملIndecomposable Skolem and Rosa sequences
We introduce indecomposable (hooked) Skolem sequences and we show their existence for all admissible orders. We then introduce a new construction for two-fold triple systems from two-fold Skolem sequences, and use this to motivate the concept of a two-fold Rosa sequence, whose existence we show for all admissible orders.
متن کاملNP-completeness of generalized multi-Skolem sequences
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The existence question of deciding which sets of the form A = {1, . . . , n} are Skolem sets was solved by Thoralf Skolem [6] in 195...
متن کاملExtending Skolem sequences, how can you begin?
For each n ≥ 1 and 1 ≤ j ≤ n we show the existence of an extended Skolem sequence of order n starting with the symbol j.
متن کاملGood sequences, bijections and permutations
In the present paper we study general properties of good sequences by means of a powerful and beautiful tool of combinatorics—the method of bijective proofs. A good sequence is a sequence of positive integers k = 1, 2, . . . such that the element k occurs before the last occurrence of k + 1. We construct two bijections between the set of good sequences of length n and the set of permutations of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1981
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90214-4